Criticality of lateral inhibition for edge enhancement in neural systems
نویسندگان
چکیده
منابع مشابه
Criticality of lateral inhibition for edge enhancement in neural systems
Although the role of lateral inhibition in edge (contrast) enhancement is well known, it has not been parametrized. This paper investigates the imbalance between the lateral inhibitory and excitatory stimuli and its effect on the edge enhancement and stability. It is shown that this imbalance can be expressed through g, a ratio of inhibitory to excitatory weights in a neuron. Stability requires...
متن کاملNeural Edge Enhancer for Supervised Edge Enhancement from Noisy Images
We propose a new edge enhancer based on a modified multilayer neural network, which is called a neural edge enhancer (NEE), for enhancing the desired edges clearly from noisy images. The NEE is a supervised edge enhancer: Through training with a set of input noisy images and teaching edges, the NEE acquires the function of a desired edge enhancer. The input images are synthesized from noiseless...
متن کاملEdge Criticality in Graph Domination
A vertex subset D ⊆ V of a graph G = (V, E) is a dominating set of G if each vertex of G is a member of D or is adjacent to a member of D. The cardinality of a smallest dominating set of G is called the domination number of G and a nonempty graph G is q-critical if q is the smallest number of arbitrary edges of G whose removal fromG necessarily increases the domination number of the resulting g...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Edge criticality in secure graph domination
The domination number of a graph is the cardinality of a smallest subset of its vertex set with the property that each vertex of the graph is in the subset or adjacent to a vertex in the subset. This graph parameter has been studied extensively since its introduction during the early 1960s and finds application in the generic setting where the vertices of the graph denote physical entities that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2007
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2006.03.017